Multimodal Optimization of Permutation Flow-Shop Scheduling Problems Using a Clustering-Genetic-Algorithm-Based Approach

نویسندگان

چکیده

Though many techniques were proposed for the optimization of Permutation Flow-Shop Scheduling Problem (PFSSP), current only provide a single optimal schedule. Therefore, new algorithm is proposed, by combining k-means clustering and Genetic Algorithm (GA), multimodal PFSSP. In algorithm, first utilized to cluster individuals every generation into different clusters, based on some machine-sequence-related features. Next, operators GA are applied belonging same find multiple global optima. Unlike standard GA, where all belong cluster, in approach, these split clusters crossover operator restricted cluster. Doing so, enabled potentially optima each The performance was evaluated its application benchmark results obtained also compared when other niching such as clearing method, sharing fitness, hybrid approach fitness used. case studies showed that able consistently converge better solutions than three algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints

In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...

متن کامل

A genetic algorithm for flow shop scheduling problems

We propose a Genetic Algorithm for scheduling multiprocessor tasks in multi-stage flow-shop environments. We present two special crossover operators that we developed for this particular problem, together with the implementation of mutation operators as well as a partial reshuffling procedure. We conclude with the results of our computational experiments. 1. Problem Definition We consider multi...

متن کامل

A cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling

Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...

متن کامل

A Novel Hybrid Algorithm for Permutation Flow Shop Scheduling

In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customer’s constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning. This paper proposes the permutation flow shop sequencing pr...

متن کامل

milp formulation and genetic algorithm for non-permutation flow shop scheduling problem with availability constraints

in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2021

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app11083388